Quadratic-Time Linear-Space Algorithms for Generating Orthogonal Polygons with a Given Number of Vertices
نویسندگان
چکیده
We propose Inflate-Paste – a new technique for generating orthogonal polygons with a given number of vertices from a unit square based on gluing rectangles. It is dual to Inflate-Cut – a technique we introduced in [12] that works by cutting rectangles.
منابع مشابه
A Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملGenerating Random Orthogonal Polygons
We propose two different methods for generating random orthogonal polygons with a given number of vertices. One is a polynomial time algorithm and it is supported by a technique we developed to obtain polygons with an increasing number of vertices starting from a unit square. The other follows a constraint programming approach and gives great control on the generated polygons. In particular, it...
متن کاملGenerating Random Polygons with Given Vertices
The problem of generating \random" geometric objects is motivated by the need to generate test instances for geometric algorithms. We examine the speciic problem of generating a random x-monotone polygon on a given set of n vertices. Here, \random" is taken to mean that we select uniformly at random a polygon, from among all those x-monotone polygons having the given n vertices. We give an algo...
متن کاملOrthogonal Polygons as Bounding Structures in Filter-Refine Query Processing Strategies
The use of bounding structures in the form of orthogonal polygons (also known as rectilinear polygons) with a varying number of vertices in contrast with a minimum bounding rectangle (an orthogonal polygon with just 4 vertices in two dimensions) as an object approximation method is presented. Orthogonal polygons can be used to improve the performance of the re ne step in the lterre ne query pro...
متن کاملSingle-Point Visibility Constraint Minimum Link Paths in Simple Polygons
We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...
متن کامل